#include <bits/stdc++.h>
using namespace std;

int a[100005];

int main()
{
    freopen ("duel.in", "r", stdin);
    freopen ("duel.out", "w", stdout);
    int n, x, mx = 0, s = 0, q = 0, l = 100001;
    scanf ("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        scanf ("%d", &x);
        a[x]++;
        mx = max(mx, x);
        l = min(l, x);
    }
    for (int i = l; i <= mx; i++)
    {
        if (a[i] != 0)
        {
            s += a[i];
            s -= min(q, a[i]);
            q = a[i];
        }
    }
    printf ("%d", s);
    return 0;
}
